The worst-case wind power scenario for adaptive robust unit commitment problems

G. Morales-España, J. García-González, A. Ramos

Summary:
This paper provides a tight description for the basic operating constraints of generating units for unit commitment (UC) problems: 1) generation limits, including 2) startup and shutdown capabilities, and 3) minimum up and down times. The Mixed-Integer Programming (MIP) formulation can be solved as a Linear Programming (LP) problem since its LP solution already provides integer solutions, hence obtaining dramatic improvements in computation time. We provide evidence of this by experimentally checking that all vertices of the feasible region are integer, and by solving a self-UC for different case studies.

Keywords: Unit Commitment (UC), Mixed-Integer Programming (MIP), Tight Formulation, Convex Hull.

Registration date: 11/11/2013

IIT-13-155A

 Request the document to be emailed to you.

Due to copyright restriction we cannot distribute this content on the web. However, using the next form you can contact the authors, which are allowed to redistribute a limited number of copies of it by email. Please, check your spam folder.

Your name:
Your email:
Your company:
Code:
I accept the Privacy Policy	Yes.